Reasoning with Intensional Negative Adjectivals: Semantics, Pragmatics, and Context

Intensional negative adjectives alleged , artificial , fake , false , former , and toy are unusual adjectives that depending on context may or may not be restricting functions. A formal theory of their semantics, pragmatics, and context that uniformly accounts for their complex mathematical and computational characteristics and captures some peculiarities of individual adjectives is presented.
Such adjectives are formalized as new concept builders, negation‐like functions that operate on the values of intensional properties of the concepts denoted by their arguments and yield new concepts whose intensional properties have values consistent with the negation of the old values. Understanding these new concepts involves semantics, pragmatics and context‐dependency of natural language. It is argued that intensional negative adjectives can be viewed as a special‐purpose, weaker, conntext‐dependent negationin natural language. The theory explains and predicts many inferences licensed by expressions involving such adjectives. Implementation of sample examples demonstrates its computational feasibility. Computation of context‐dependent interpretation is discussed.
The theory allows one to enhance a knowledge representation system with similar concept building, negation‐like, context‐dependent functions, the availability of which appears to be a distinct characteristic of natural languages.     

探索后现代建筑设计中矛盾性符号的运用

本文主要从符号学的角度探索了后现代建筑设计的主要特点,提出后现代建筑自身存在着风格符号的矛盾性,并以"loft"风格的建筑设计作为后现代建筑设计的典型例子,来分析探讨它特征符号的矛盾性以及它的优点和独特之处,并提出可以把这种后现代主义建筑的矛盾性特点符号相调和,运用到室内设计中。     

含蓄否定(英文)

一句话中,既可使用否定词也可使用肯定式来实现否定;后者叫做含蓄否定或是隐蔽否定。用含蓄否定所表达的否定意思要比一般否定语气更为含蓄、委婉、诙谐。在有些语境中,含蓄否定的语气更为有力、强烈。在英语中,可以通过反问句、虚拟从句、状语从句、词语搭配以及词汇等方法达到含蓄否定的目的。     

习惯领域与伪矛盾问题的转换桥

本文建立了决策主体关于问题的习惯领域的物元模型,提出了伪矛盾问题的概念,研究了习惯领域与伪矛盾问题的产生与转化的关系,给出了构造伪矛盾问题的转换桥的一种方法.     

可拓创新方法在产品设计中的应用

目的介绍和分析中国人原创的可拓创新方法体系在设计创意生成与解决设计过程中矛盾问题方面的优势,阐释应用该方法进行产品设计时,可以使设计过程不过度依赖于设计人员。方法从论文论著发表情况、软件著作权和专利情况、承接项目情况等方面,介绍了可拓创新方法的研究概况;综述可拓创新方法在新产品与新项目设计创意的生成、解决产品设计中的矛盾问题等方面的应用情况,以及可拓创新软件的研制情况。结论该方法具有深厚的理论基础,定性分析与定量计算相结合,可操作性强,具有重要的方法论价值和广阔的应用前景。     

矛盾信息特征提取研究

把矛盾问题处理为相容问题是计算机智能化水平的重要体现,也是人工智能面临的重要问题之一。本文从信息处理的智能化角度出发,研究矛盾问题中矛盾信息的特征提取。本研究为利用计算机辅助解决矛盾问题提供了可行的工具,为提高计算机智能化水平创造了基础条件。     

The Basic Constructive Logic for Negation-Consistency

In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic B_Kc4, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending B_Kc4 up to minimal intuitionistic logic. All logics defined in this paper are paraconsistent logics.     

直觉模糊逻辑非算子与蕴涵算子的一些性质及证明

给出了直觉模糊逻辑非算子的定义,讨论了非算子的一些性质。提出了关于直觉蕴涵算子的两个重要定理,并给出了证明     

On querying simple conceptual graphs with negation

We consider basic conceptual graphs, namely simple conceptual graphs (SGs), which are equivalent to the existential conjunctive positive fragment of first-order logic. The fundamental problem, deduction, is performed by a graph homomorphism called projection. The existence of a projection from a SG Q to a SG G means that the knowledge represented by Q is deducible from the knowledge represented by G. In this framework, a knowledge base is composed of SGs representing facts and a query is itself a SG. We focus on the issue of querying SGs, which highlights another fundamental problem, namely query answering. Each projection from a query to a fact defines an answer to the query, with an answer being itself a SG. The query answering problem asks for all answers to a query.

This paper introduces atomic negation into this framework. Several understandings of negation are explored, which are all of interest in real world applications. In particular, we focus on situations where, in the context of incomplete knowledge, classical negation is not satisfactory because deduction can be proven but there is no answer to the query. We show that intuitionistic deduction captures the notion of an answer and can be solved by projection checking. Algorithms are provided for all studied problems. They are all based on projection. They can thus be combined to deal with several kinds of negation simultaneously. Relationships with problems on conjunctive queries in databases are recalled and extended. Finally, we point out that this discussion can be put in the context of semantic web databases.     

Strong Negation and Equivalence in the Safe Belief Semantics

The safe belief semantics uses intermediate logics to definean extension of answer sets to all propositional formulas, butonly considering one kind of negation. In this work we extendsafe beliefs adding the strong negation connective. The mainfeature of our extension is that strong negation can occur beforeany formula, and not only at the atomic level. We give resultsconcerning the relation between strong negation extensions ofintermediate logics and safe beliefs and consider the way inwhich strong negation can be eliminated from any formula whilepreserving its semantics. We also propose two new notions ofequivalence: substitution equivalence and contextualized equivalence.We prove that they are both more general than strong equivalenceand, for propositional formulas where strong negation may occurat the non-atomic level, substitution equivalence captures anotion of equivalence that cannot be captured by strong equivalencealone.